MRRK-SRPT: a Scheduling Policy for Parallel Servers
نویسندگان
چکیده
For a system with a dispatcher and several identical servers in parallel, we propose a policy consisting of modified multi-layered round robin routing followed by shortest remaining processing time scheduling. We show that this policy has a heavy traffic limit that is identical to one in which there is a single queue (no routing) and optimal scheduling. Under light traffic, this policy is asymptotically optimal in the sense that it minimizes the first two terms of the Taylor series expansion for the waiting time. Additional simulation results show that this policy performs well under various conditions and that using policies other than shortest remaining processing time may yield reasonable performance.
منابع مشابه
Implementation of SRPT Scheduling in Web Servers
This paper proposes a method for improving the performance of Web servers servicing static HTTP requests. The idea is to give preference to those requests which are quick, or have small remaining processing requirements, in accordance with the SRPT (Shortest-Remaining-Processing-Time) scheduling policy. The implementation is at the kernel level and involves controlling the order in which socket...
متن کاملApplications of SRPT Scheduling with Inaccurate Information
The Shortest Remaining Processing Time (SRPT) scheduling policy was proven, in the 1960s, to yield the smallest mean response time, and recently it was proven its performance gain over Processor Sharing (PS) usually does not come at the expense of large jobs. However, despite the many advantages of SRPT scheduling, it is not widely applied. One important reason for the sporadic application of S...
متن کاملScheduling Solutions for Coping with Transient Overload 1
For most computer systems, even short periods of overload degrade performance signi cantly. The number of jobs in the system quickly grows, often exceeding the capacity of the system within just seconds, and response times explode. In this paper we investigate system behavior under transient overload. We nd that the poor behavior of systems under transient overload can at least partly be attrib...
متن کاملSWIFT: Scheduling in Web Servers for Fast Response Time
This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the Shortest Remaining Processing Time scheduling (SRPT) in Web servers in order to give preference to requests for short files. However, by considering only the size of the file for determining the priority of requests, the previous wor...
متن کامل: An Efficient Scheduling Policy for Edge Routers to Speedup the Internet Access
Recent Internet traffic measurements reveal that Internet traffic exhibits high coefficient of variability (CoV). That is, the Internet traffic consists of many small jobs and very few large jobs, and less than 1% of the largest jobs constitute more than half of the load. Consequently, we propose to use policies that take advantage of this attribute to favor small jobs over large jobs. If such ...
متن کامل